In this paper, we consider the problem of path finding for a set of homogeneous and autonomous agents navigating a previously unknown stochastic environment. In our problem setting, each agent attempts to maximize a given utility function while respecting safety properties. Our solution is based on ideas from evolutionary game theory, namely replicating policies that perform well and diminishing ones that do not. We do a comprehensive comparison with related multiagent planning methods, and show that our technique beats state of the art RL algorithms in minimizing path length by nearly 30% in large spaces. We show that our algorithm is computationally faster than deep RL methods by at least an order of magnitude. We also show that it scales better with an increase in the number of agents as compared to other methods, path planning methods in particular. Lastly, we empirically prove that the policies that we learn are evolutionarily stable and thus impervious to invasion by any other policy.

自然语言是人类将任务传达给机器人的直觉方式。尽管自然语言（NL）是模棱两可的，但现实世界的任务及其安全要求需要明确传达。信号时间逻辑（STL）是一种形式的逻辑，可以用作描述机器人任务的多功能，表达和明确的形式语言。一方面，使用STL用于机器人域的现有工作通常要求最终用户在STL中表达任务规格，这是非专家用户的挑战。另一方面，从NL转换为STL规范的转换限制为特定片段。在这项工作中，我们提出了Dialoguestl，这是一种从（通常）模棱两可的NL描述中学习正确和简洁的STL公式的交互方法。我们结合了语义解析，基于预训练的变压器的语言模型以及少数用户演示的用户澄清，以预测编码NL任务描述的最佳STL公式。将NL映射到STL的一个优点是，在使用增强学习（RL）以识别机器人的控制策略方面，最近有很多工作。我们表明，我们可以使用深层学习技术来从学习的STL规范中学习最佳策略。我们证明DialogUestl具有高效，可扩展性和健壮性，并且在预测正确的STL公式方面具有很高的精度，并与Oracle用户进行了一些演示和一些交互。

自动化车辆（AV）在很大程度上取决于强大的感知系统。评估视觉系统的当前方法主要关注逐帧性能。当在AV中使用时，这种评估方法似乎不足以评估感知子系统的性能。在本文中，我们提出了一种逻辑（称为时空感知逻辑（STPL）），该逻辑同时使用了空间和时间方式。STPL可以使用空间和时间关系来实现对感知数据的推理。STPL的一个主要优点是，即使在某些情况下没有地面真相数据，它也可以促进感知系统实时性能的基本理智检查。我们确定了STPL的片段，该片段是在多项式时间内有效地监视离线的。最后，我们提供了一系列针对AV感知系统的规格，以突出显示可以通过STPL通过离线监控来表达和分析的要求类型。

In the learning from demonstration (LfD) paradigm, understanding and evaluating the demonstrated behaviors plays a critical role in extracting control policies for robots. Without this knowledge, a robot may infer incorrect reward functions that lead to undesirable or unsafe control policies. Recent work has proposed an LfD framework where a user provides a set of formal task specifications to guide LfD, to address the challenge of reward shaping. However, in this framework, specifications are manually ordered in a performance graph (a partial order that specifies relative importance between the specifications). The main contribution of this paper is an algorithm to learn the performance graph directly from the user-provided demonstrations, and show that the reward functions generated using the learned performance graph generate similar policies to those from manually specified performance graphs. We perform a user study that shows that priorities specified by users on behaviors in a simulated highway driving domain match the automatically inferred performance graph. This establishes that we can accurately evaluate user demonstrations with respect to task specifications without expert criteria.

许多智能交通系统是多种代理系统，即交​​通参与者和运输基础设施内的子系统都可以被建模为互动代理。使用基于AI的方法在不同的代理系统之间实现协调可以提供更好的安全系统，这些运输系统仅包含人类操作车辆的运输系统，并在交通吞吐量，传感范围和启用协作任务方面提高系统效率。然而，增加的自主权使运输基础设施容易受到损害的车辆代理或基础设施。本文通过将信托权限嵌入运输基础设施来系统地量化称为主观逻辑的认知逻辑来系统地量化代理商的可信度来提出新的框架。在本文中，我们提出了以下新的贡献：（i）我们提出了一个框架，以利用代理商的量化可靠性来实现信任感知的协调和控制。 （ii）我们展示如何使用基于强化学习的方法来综合信任感知控制器。 （iii）我们全面分析了自主交叉口管理（AIM）案例研究，并制定了一个名为AIM-Trust的信任知识版本，导致在由可信和不受信任的代理商的混合中的情景中导致事故率降低。

Large language models (LLMs) have been shown to be able to perform new tasks based on a few demonstrations or natural language instructions. While these capabilities have led to widespread adoption, most LLMs are developed by resource-rich organizations and are frequently kept from the public. As a step towards democratizing this powerful technology, we present BLOOM, a 176B-parameter open-access language model designed and built thanks to a collaboration of hundreds of researchers. BLOOM is a decoder-only Transformer language model that was trained on the ROOTS corpus, a dataset comprising hundreds of sources in 46 natural and 13 programming languages (59 in total). We find that BLOOM achieves competitive performance on a wide variety of benchmarks, with stronger results after undergoing multitask prompted finetuning. To facilitate future research and applications using LLMs, we publicly release our models and code under the Responsible AI License.

Recent developments in quantum computing and machine learning have propelled the interdisciplinary study of quantum machine learning. Sequential modeling is an important task with high scientific and commercial value. Existing VQC or QNN-based methods require significant computational resources to perform the gradient-based optimization of a larger number of quantum circuit parameters. The major drawback is that such quantum gradient calculation requires a large amount of circuit evaluation, posing challenges in current near-term quantum hardware and simulation software. In this work, we approach sequential modeling by applying a reservoir computing (RC) framework to quantum recurrent neural networks (QRNN-RC) that are based on classical RNN, LSTM and GRU. The main idea to this RC approach is that the QRNN with randomly initialized weights is treated as a dynamical system and only the final classical linear layer is trained. Our numerical simulations show that the QRNN-RC can reach results comparable to fully trained QRNN models for several function approximation and time series prediction tasks. Since the QRNN training complexity is significantly reduced, the proposed model trains notably faster. In this work we also compare to corresponding classical RNN-based RC implementations and show that the quantum version learns faster by requiring fewer training epochs in most cases. Our results demonstrate a new possibility to utilize quantum neural network for sequential modeling with greater quantum hardware efficiency, an important design consideration for noisy intermediate-scale quantum (NISQ) computers.

音频文本检索需要自然语言查询以在数据库中检索相关的音频文件。相反，文本审计检索将音频文件作为查询来检索相关的自然语言描述。大多数带有一个音频字幕数据集的文献训练检索系统，但是评估多个数据集培训的好处是没有充满反感的。此外，检索系统必须学习描述从几秒钟到几秒钟的可变长度的音频内容之间的详细句子之间的对齐。在这项工作中，我们提出了一个新的Web音频文本对以及一个新的检索框架。首先，我们提供了大约五千个Web音频纹理对的新集合，我们称为WavText5k。当用来训练我们的检索系统时，WavText5K比其他音频字幕更多地提高了性能。其次，我们的框架学会了使用文本编码器，两个音频编码器和对比度学习目标来连接语言和音频内容。组合两个音频编码器有助于处理可变长度音频。这两个贡献超过了AudioCaps和Clote的Text-Audio检索的最新表现，相对2％和16％，而音频检索则达到6％和23％。

在包括搜索在内的各种应用程序中，积极消费数字文档的研究范围为研究范围。传统上，文档中的搜索是作为文本匹配的问题施放的，忽略了结构化文档，表格等中常见的丰富布局和视觉提示。为此，我们提出了一个大多数未探索的问题：“我们可以搜索其他类似的snippets在目标文档页面中存在给定文档摘要的单个查询实例吗？”。我们建议单体将其作为单拍的摘要检测任务解决。单体融合了摘要和文档的视觉，文本和空间方式的上下文，以在目标文档中找到查询片段。我们进行了广泛的消融和实验，显示单体从一击对象检测（BHRL），模板匹配和文档理解（Layoutlmv3）中优于几个基线。由于目前的任务缺乏相关数据，因此我们对单体进行了编程生成的数据训练，该数据具有许多视觉上相似的查询片段和来自两个数据集的目标文档对 - Flamingo表单和PublayNet。我们还进行人类研究以验证生成的数据。

随着计算机视觉技术的进步，根据其功能对图像进行分类的需求已成为一项巨大的任务和必要性。在此项目中，我们提出了2种模型，即使用ORB和SVM的特征提取和分类，第二个是使用CNN体系结构。该项目的最终结果是了解特征提取和图像分类背后的概念。训练有素的CNN模型还将用于将其转换为用于Android开发的TFLITE格式。